On Mechanisms Eliciting Ordinal Preferences

نویسنده

  • Gabriel Carroll
چکیده

When is a mechanism designer justified in only asking for ordinal information about preferences? Simple examples show that, even if the planner’s goal (expressed by a social choice correspondence, or SCC) depends only on ordinal information, eliciting cardinal information may help with incentives. However, if agents may be uncertain about their own cardinal preferences, then a strong robustness requirement can justify the focus on ordinal mechanisms. Specifically, when agents’ preferences over pure outcomes are strict, if a planner is able to implement an SCC (in ex-post equilibrium) using a mechanism that is robust to interdependence of arbitrary form in cardinal preferences, then there must exist such a mechanism that elicits only ordinal preferences. The strictness assumption can be dropped if we further allow the possibility of non-expected-utility preferences. Thanks to (in random order) Juuso Toikka, Alex Wolitzky, Muhamet Yildiz, Yuichiro Kamada, Bengt Holmström, and Daron Acemoglu, and especially to Parag Pathak, for helpful discussions and advice. Suggestions from co-editor Thomas Mariotti and three referees also improved the paper. Dan Walton provided valuable research assistance.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Empirical Comparison of One-Sided Matching Mechanisms

For one-sided matching problems, two widely studied mechanisms are the Random Serial Dictatorship (RSD) and the Probabilistic Serial Rule (PS). Both mechanisms require only that agents specify ordinal preferences and have a number of desirable economic and computational properties. However, the induced outcomes of the mechanisms are often incomparable and thus there are challenges when it comes...

متن کامل

Investigating the Characteristics of One-Sided Matching Mechanisms Under Various Preferences and Risk Attitudes

One-sided matching mechanisms are fundamental for assigning a set of indivisible objects to a set of self-interested agents when monetary transfers are not allowed. Two widely-studied randomized mechanisms in multiagent settings are the Random Serial Dictatorship (RSD) and the Probabilistic Serial Rule (PS). Both mechanisms require only that agents specify ordinal preferences and have a number ...

متن کامل

An Axiomatic Decomposition of Strategyproofness for Ordinal Mechanism with Indifferences∗

We study mechanism which operate on ordinal preference information (i.e., rank ordered lists of alternatives) on the full domain of weak preferences that admits indifferences. We present a novel decomposition of strategyproofness into three axioms: separation monotonic, separation upper invariant, and separation lower invariant. Each axiom is a natural restriction on how mechanisms can react wh...

متن کامل

Matching with Dynamic Ordinal Preferences

We consider the problem of repeatedly matching a set of alternatives to a set of agents with dynamic ordinal preferences. Despite a recent focus on designing one-shot matching mechanisms in the absence of monetary transfers, little study has been done on strategic behavior of agents in sequential assignment problems. We formulate a generic dynamic matching problem via a sequential stochastic ma...

متن کامل

Incentives in One-Sided Matching Problems With Ordinal Preferences

One of the core problems in multiagent systems is how to efficiently allocate a set of indivisible resources to a group of self-interested agents that compete over scarce and limited alternatives. In these settings, mechanism design approaches such as matching mechanisms and auctions are often applied to guarantee fairness and efficiency while preventing agents from manipulating the outcomes. I...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2017